Weight Spectrum of Codes Associated With the Grassmannian <formula formulatype="inline"><tex Notation="TeX">$G(3,7)$</tex></formula>
نویسندگان
چکیده
منابع مشابه
Weight spectrum of codes associated with the Grassmannian G(3,7)
In this paper we consider the problem of determining the weight spectrum of q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m = 6 this was done in [1]. We derive a formula for the weight of a codeword of C(3,m), in terms of certain varieties associated with alternating trilinear forms on F q . The classification of such forms under the action of the general linear group GL(m,...
متن کاملThe Weight Distribution of a Family of Lagrangian-Grassmannian Codes
Using Plücker coordinates we construct a matrix whose columns parametrize all projective isotropic lines in a symplectic space E of dimension 4 over a finite field Fq. As an application of this construction we explicitly obtain the smallest subfamily of algebro-geometric codes defined by the corresponding Lagrangian-Grassmannian variety. Furthermore, we show that this subfamily is a class of th...
متن کاملMaximum Weight Spectrum Codes
In the recent work [7], a combinatorial problem concerning linear codes over a finite field Fq was introduced. In that work the authors studied the weight set of an [n, k]q linear code, that is the set of non-zero distinct Hamming weights, showing that its cardinality is upper bounded by q −1 q−1 . They showed that this bound was sharp in the case q = 2, and in the case k = 2. They conjectured ...
متن کاملEquidistant codes in the Grassmannian
Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codeswhichmight produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over Fq , n ≥ k+1 2 , where the cod...
متن کاملMatrix Codes as Ideals for Grassmannian Codes and their Weight Properties
Abstract—A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field Fp is introduced. The matrix codes are Fp-subspaces of the ring M2(Fp) of 2 × 2 matrices over Fp on which the rank metric is applied, and are generated as onesided proper principal ideals by idempotent elements of M2(Fp). Furthermore a weight function on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2219497